Implementation and Analysis of the Todd - Coxeter Algorithm
نویسندگان
چکیده
A recent form of the Todd-Coxeter algorithm, known as the lookahead algorithm, is described. The time and space requirements for this algorithm are shown experimentally to be usually either equivalent or superior to the Felsch and HaselgroveLeech-Trotter algorithms. Some findings from an experimental study of the behaviour of Todd-Coxeter programs in a variety of situations are given.
منابع مشابه
The Schreier-Sims algorithm for matrix groups
This is the report of a project with the aim to make a new implementation of the Schreier-Sims algorithm in GAP, specialized for matrix groups. The standard Schreier-Sims algorithm is described in some detail, followed by descriptions of the probabilistic Schreier-Sims algorithm and the Schreier-Todd-Coxeter-Sims algorithm. Then we discuss our implementation and some optimisations, and finally ...
متن کاملProving the efficiency of pro-2-groups of fixed co-classes
Among the six classes of pro-2-groups of finite and fixed co-classes and trivial Schur Multiplicator which studied by Abdolzadeh and Eick in 2009, there are two classes $$S_5=langle a,bmid [b,a^2]=1, a^2=[b,a]^2, (b^2)^{[b,a]}b^2=1rangle$$ and $$S_6=langle a,t,bmid a^2=b^2,[b,a]^2=1, t^a=t^{-1}[b,a], b^t=abarangle$$that have been conjectured to have deficiency zero presentations. In this paper ...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملA New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibili...
متن کاملOn doing Todd-Coxeter enumeration in parallel*
Akl, S., G. Laborite, M. Leeder and K. Qiu, On doing Todd-Coxeter coset enumeration in parallel, Discrete Applied Mathematics 34 (1991) 27-35. The Todd-Coxeter coset enumeration method is without any doubt the best known and most used method in computational group theory. Surprisingly, however, it seems that no attempt has yet been made at producing a parallel version of it. This paper reports ...
متن کامل